Totally homogeneous networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On homogeneous totally disconnected 1-dimensional spaces

The Cantor set and the set of irrational numbers are examples of 0dimensional, totally disconnected, homogeneous spaces which admit elegant characterizations and which play a crucial role in analysis and dynamical systems. In this paper we will start the study of 1-dimensional, totally disconnected, homogeneous spaces. We will provide a characterization of such spaces and use it to show that ma...

متن کامل

Subadditive and Homogeneous of Degree One Games Are Totally Balanced

A cooperative game with transferable utility is said to be homogeneous of degree one if for any integer m, the value of cloning m times all players at any given coalition, leads to m times the value of the original coalition. We show that this property coupled with sub-additivity, guarantee the non-emptyness of the core of the game and of all its subgames, namely the game is totally balanced. E...

متن کامل

On Totally Weighted Interconnection Networks

In a network, each arc is assigned a weight. The weight of a path or a cycle is defined as the minimum weight of its arcs. The maximum of weights of all paths between two nodes is defined as the strength of connectedness between the nodes. In network applications, the reduction in the strength of connectedness is more relevant than the total disconnection of the graph. A graph is totally weight...

متن کامل

Causal and homogeneous networks

Growing networks have a causal structure. We show that the causality strongly influences the scaling and geometrical properties of the network. In particular the average distance between nodes is smaller for causal networks than for corresponding homogeneous networks. We explain the origin of this effect and illustrate it using as an example a solvable model of random trees. We also discuss the...

متن کامل

Totally asymmetric simple exclusion process on networks.

We study the totally asymmetric simple exclusion process (TASEP) on complex networks, as a paradigmatic model for transport subject to excluded volume interactions. Building on TASEP phenomenology on a single segment and borrowing ideas from random networks we investigate the effect of connectivity on transport. In particular, we argue that the presence of disorder in the topology of vertices c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: National Science Review

سال: 2019

ISSN: 2095-5138,2053-714X

DOI: 10.1093/nsr/nwz050